Network design for time‐constrained delivery

To meet customer demand, delivery companies are offering an increasing number of time‐definite services. In this article, we examine the strategic design of delivery networks which can efficiently provide these services. Because of the high cost of direct connections, we focus on tree‐structured networks. As it may not be possible to identify a tree‐structured network that satisfies all of the delivery guarantees, we allow these guarantees to be violated but seek to minimize the sum of the violations. We establish the complexity of the problem and exploit an empirically identified solution structure to create new neighborhoods which improve solution values over more general neighborhood structures. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

编队协同防空制导交接仿真研究

协同制导是编队协同防空作战中的一种重要作战手段.制导交接又是协同制导中的关键环节.对制导交接方式的选择进行了说明,分析了理想和实际交接区的范围,对水平交接区进行了仿真分析,对协同制导时的航路规划提出了要求.结果表明,只有交接平台以及导弹的相对位置以及导弹航路满足一定要求,才能顺利完成制导交接.     

Strategic capacity decision‐making in a stochastic manufacturing environment using real‐time approximate dynamic programming

In this study, we illustrate a real‐time approximate dynamic programming (RTADP) method for solving multistage capacity decision problems in a stochastic manufacturing environment, by using an exemplary three‐stage manufacturing system with recycle. The system is a moderate size queuing network, which experiences stochastic variations in demand and product yield. The dynamic capacity decision problem is formulated as a Markov decision process (MDP). The proposed RTADP method starts with a set of heuristics and learns a superior quality solution by interacting with the stochastic system via simulation. The curse‐of‐dimensionality associated with DP methods is alleviated by the adoption of several notions including “evolving set of relevant states,” for which the value function table is built and updated, “adaptive action set” for keeping track of attractive action candidates, and “nonparametric k nearest neighbor averager” for value function approximation. The performance of the learned solution is evaluated against (1) an “ideal” solution derived using a mixed integer programming (MIP) formulation, which assumes full knowledge of future realized values of the stochastic variables (2) a myopic heuristic solution, and (3) a sample path based rolling horizon MIP solution. The policy learned through the RTADP method turned out to be superior to polices of 2 and 3. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010     

离散型随机BAM神经网络时滞分布依赖全局指数稳定性

研究一类具有随机时滞与随机干扰的离散型BAM神经网络的全局指数稳定性,所建模型同时考虑离散时滞变化区间与分布概率对稳定性的影响．通过构造新的Lyapunov泛函并结合线性矩阵不等式（LMI）方法,得到了均方意义下依赖于时滞分布的全局指数稳定性条件．     

基于动态贝叶斯网的炮兵战斗效果评估建模仿真

依据炮兵火力作战的特点规律,分析炮兵战斗效果评估的内容、程序、建模过程和影响因素,运用动态Bayesian网建立炮兵战斗效果评估模型,运用主成分分析方法确定评估专家权重,运用Poly Tree的消息传递算法进行评估网络推理分析,最后结合案例仿真验证。结果表明,该研究解决了情报信息不确定性、模糊性和动态性等影响战斗效果精确评估问题。     

基于IEEE 802.11的无线多跳网络路径容量分析模型

旨在建立一个适用于无线多跳路径性能研究的闭合分析模型。首先对导致多跳路径中流内竞争现象的干扰问题进行了详细分析并给出了定量计算方法,然后通过将多跳路径建模为排队网络,利用扩散近似法建立了路径性能分析模型,最后在网络稳定性约束条件下对多跳路径的容量问题进行了研究。利用该模型可以在无线多跳网络中分析网络传输的吞吐能力,同时有助于研究网络对QoS业务的支持能力。通过仿真实验结果与数值分析结果的对比,验证了分析模型的准确性。     

水下传感器网络冗余设计

冗余设计可以有效地延长水下传感器网络寿命和提高网络可靠性,基于可靠性理论,考虑水下传感器网络环境及节点垂直移动等约束,在对冗余非共享方案研究的基础上,结合水下传感器网络特点,提出了适合于水下传感器网络特点的冗余共享设计方案,并给出了冗余共享方案的可靠性模型,通过数值计算,研究了网络可靠性变化曲线及冗余节点数与网络寿命的关系。经过MATLAB软件仿真,表明在同一网络寿命情况下,相对于冗余非共享方案,冗余共享方案所需冗余节点数更少,降低了网络部署成本,达到了冗余优化的目的。     

基于复杂网络理论的军事力量部署研究

运用复杂网络理论,将军事力量部署进行网络拓扑化,通过分析计算网络关键节点的组成来研究军事力量在空间部署的合理性。在定义了军事力量部署网络拓扑化后的关键节点概念的基础上,提出了基于网络节点度和介数综合数学模型来评价网络节点关键度量值数学模型及基本算法流程,并运用案例进行了计算分析。     

适用于传感器网络战场监视系统的无锚点定位算法

针对传感器网络在军事领域的应用。本文提出一种适用于战场监视系统的三维无锚点自定位算法。该算法首先对布撒后的全网节点进行不基于地理信息的分簇算法,缩短了全网坐标建立的启动时间。当簇头节点能量将消耗尽时,再进行基于地理信息的分簇算法更新簇头节点。采用OFDM测距方法后,减小了节点间的测距误差。仿真实验表明,传感器网络鲁棒性较高,在区域为400m×400m×50m的三维空间内,随机放置200个节点,其平均定位误差为0.64%,满足战场传感器监视系统的要求。     

战场通信网络战时抗毁性初探

以战时应用为背景研究了战场通信网络的战时抗毁性定义,分析了影响抗毁性的可能因素,提出了基于干线节点密度变化、网络可通性度量及网络流量变化等的战场通信网络战时抗毁性评价指标,并提出了提高军用通信网络战时抗毁性的可能措施和方法。